The Multi-Source Probabilistically Preemptive M/PH/1/1 Queue With Packet Errors

نویسندگان

چکیده

Analytical modeling of Age Information (AoI) and Peak AoI (PAoI) has recently drawn a lot attention in the context quantitative assessment information freshness status update systems. In this paper, we study probabilistically preemptive bufferless M/PH/1/1 queue fed with packets from $N$ separate sources for which new packet arrival source- notation="LaTeX">$m$ is allowed to preempt notation="LaTeX">$n$ service, probability depending on . To make model even more general than existing ones, assume distinct phase-type (PH-type) service time distribution, error retransmission probability, each sources. Using sample path arguments theory Markov Fluid Queues (MFQ), exact distributions PAoI are numerically obtained Numerical examples provided demonstrate impact various system parameters performance. two-source system, present methodology how optimally choose preemption probabilities generation rates so as minimize certain AoI-oriented cost functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finite-Source Multiserver Queue with Preemptive Priorities

We consider systems with finite sources of requests, multiple servers, and an arbitrary number of preemptive priority classes. The service times and the source idle times are assumed to be exponentially distributed. We present an efficient approach based on marginal state description. The approach allows a recurrent analysis of priority levels where the usage of servers by higher priority reque...

متن کامل

On Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)

We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.

متن کامل

Joint queue length distribution of multi-class, single-server queues with preemptive priorities

In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive priorities between classes, by using matrix-analytic techniques. This leads to an exact method for the computation of the steady state joint queue length distribution. We also indicate how the method can be extended to models with multiple servers and other priority rules.

متن کامل

Heavy-traffic analysis of a non-preemptive multi-class queue with relative priorities

We study the steady-state queue-length vector in a multi-class queue with relative priorities. Upon service completion, the probability that the next served customer is from class k is controlled by class-dependent weights. Once a customer has started service, it is served without interruption until completion. We establish a state-space collapse for the scaled queue length vector in the heavy-...

متن کامل

Optical Packet Buffers with Active Queue Management

Active queue management (AQM) is an important function in today’s core routers that will be required in the future optical internet core. A recently reported novel architecture for optical packet buffers is extended by implementing necessary AQM functions. The suggested AQM scheme is validated and explore via simulations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2021

ISSN: ['1558-0857', '0090-6778']

DOI: https://doi.org/10.1109/tcomm.2021.3106347